Interaction mechanisms quantified from dynamical features of frog choruses.

We employ a mathematical model (a phase oscillator model) to describe the deterministic and stochastic features of frog choruses in which male frogs attempt to avoid call overlaps. The mathematical model with a general interaction term is identified using a Bayesian approach, and it qualitatively reproduces the stationary and dynamical features of the empirical data. In addition, we quantify the magnitude of attention paid among the male frogs from the identified model, and then analyse the relationship between attention and behavioural parameters using a statistical approach. Our analysis demonstrates a negative correlation between attention and inter-frog distance, and also suggests a behavioural strategy in which male frogs selectively attend to a less attractive male frog (i.e. a male producing calls at longer intervals) in order to more effectively advertise their superior relative attractiveness to females.

Asymmetric neighborhood functions accelerate ordering process of self-organizing maps.

A self-organizing map (SOM) algorithm can generate a topographic map from a high-dimensional stimulus space to a low-dimensional array of units. Because a topographic map preserves neighborhood relationships between the stimuli, the SOM can be applied to certain types of information processing such as data visualization. During the learning process, however, topological defects frequently emerge in the map. The presence of defects tends to drastically slow down the formation of a globally ordered topographic map. To remove such topological defects, it has been reported that an asymmetric neighborhood function is effective, but only in the simple case of mapping one-dimensional stimuli to a chain of units. In this paper, we demonstrate that even when high-dimensional stimuli are used, the asymmetric neighborhood function is effective for both artificial and real-world data. Our results suggest that applying the asymmetric neighborhood function to the SOM algorithm improves the reliability of the algorithm. In addition, it enables processing of complicated, high-dimensional data by using this algorithm.

Weighted spike-triggered average of a fluctuating stimulus yielding the phase response curve.

We demonstrate that the phase response curve (PRC) can be reconstructed using a weighted spike-triggered average of an injected fluctuating input. The key idea is to choose the weight to be proportional to the magnitude of the fluctuation of the oscillatory period. Particularly, when a neuron exhibits random switching behavior between two bursting modes, two corresponding PRCs can be simultaneously reconstructed, even from the data of a single trial. This method offers an efficient alternative to the experimental investigation of oscillatory systems, without the need for detailed modeling.

Ordering process of self-organizing maps improved by asymmetric neighborhood function.

The Self-organizing map (SOM) is an unsupervised learning method based on the neural computation, which has found wide applications. However, the learning process sometime takes multi-stable states, within which the map is trapped to an undesirable disordered state including topological defects on the map. These topological defects critically aggravate the performance of the SOM. In order to overcome this problem, we propose to introduce an asymmetric neighborhood function for the SOM algorithm. Compared with the conventional symmetric one, the asymmetric neighborhood function accelerates the ordering process even in the presence of the defect. However, this asymmetry tends to generate a distorted map. This can be suppressed by an improved method of the asymmetric neighborhood function. In the case of one-dimensional SOM, it is found that the required steps for perfect ordering is numerically shown to be reduced from O(N (3)) to O(N (2)). We also discuss the ordering process of a twisted state in two-dimensional SOM, which can not be rectified by the ordinary symmetric neighborhood function.